Accepting networks of splicing processors: Complexity results
نویسندگان
چکیده
In this paper we consider a new, bio-inspired computing model: the accepting network of splicing processors. We define two computational complexity classes based on this model and show how they are related to the classical ones defined for Turing machines, namely NP and PSPACE. Furthermore, we approach the topic of problem solving using these newly defined devices. In this context, a linear time solution for one of the most interesting NP-complete problems, the SAT problem, is presented. The results presented here suggest once more that nondeterminism might be approached in a deterministic way by means of multiplicities. c © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
On the size complexity of hybrid networks of evolutionary processors
The goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about the size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free lan...
متن کاملAccepting Networks of Genetic Processors are computationally complete
We propose a computational model that is inspired by genetic operations over strings such as mutation and crossover. The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such as Networks of Evolutionary Processors and Networks of Splicing Processors. These models are complete computational models inspired by DNA evolution and recombination. Here, we ...
متن کاملAccepting Networks of Evolutionary Processors with Filtered Connections
In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in ...
متن کاملComplexity Aspects of the Recognition of Regular and Context-Free Languages by Accepting Hybrid Networks of Evolutionary Processors
In this paper we address the size complexity of Accepting Hybrid Networks of Evolutionary Processors (AHNEPs) that recognize regular and context-free languages. We present AHNEPs of small constant size for both classes. We show that any regular language can be accepted by an AHNEP of size 6, while AHNEPs of size 9 suffice for all context-free languages, moreover accepting them in linear time. B...
متن کاملTarget Based Accepting Networks of Evolutionary Processors with Regular Filters
In this paper, a new definition of accepting networks – called target based accepting networks – is given. In a target based accepting network of evolutionary processors, each node is equipped with a regular language – the target set. As soon as a node contains a word of its target set, the input word is accepted by the network. In this way, no further output nodes are necessary. It is shown th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 371 شماره
صفحات -
تاریخ انتشار 2007